Automata theory

Results: 1263



#Item
61An Automata Model for Trees with Ordered Data Values Tony Tan University of Edinburgh Edinburgh, UK Email:

An Automata Model for Trees with Ordered Data Values Tony Tan University of Edinburgh Edinburgh, UK Email:

Add to Reading List

Source URL: alpha.uhasselt.be

Language: English - Date: 2013-09-27 07:35:34
62A Comparison of Succinctly Represented Finite-state Systems ⋆ Romain Brenguier1 , Stefan G¨oller2 , and Ocan Sankur1 1  2

A Comparison of Succinctly Represented Finite-state Systems ⋆ Romain Brenguier1 , Stefan G¨oller2 , and Ocan Sankur1 1 2

Add to Reading List

Source URL: www.informatik.uni-bremen.de

Language: English - Date: 2012-09-12 07:18:02
63Cellular Automata and the Mechanisms of Nature Based on Chapter 2: The Crucial Experiment, from A New Kind of Science by Stephen Wolfram If a cell and its neighbors look like this at one step Cellular automata are exampl

Cellular Automata and the Mechanisms of Nature Based on Chapter 2: The Crucial Experiment, from A New Kind of Science by Stephen Wolfram If a cell and its neighbors look like this at one step Cellular automata are exampl

Add to Reading List

Source URL: www.wolframscience.com

Language: English - Date: 2005-05-25 10:34:56
64Investigations on Automata and Languages over a Unary Alphabet Giovanni Pighizzini Dipartimento di Informatica Università degli Studi di Milano, Italy

Investigations on Automata and Languages over a Unary Alphabet Giovanni Pighizzini Dipartimento di Informatica Università degli Studi di Milano, Italy

Add to Reading List

Source URL: pighizzini.di.unimi.it

Language: English - Date: 2014-08-01 10:23:11
65Regular Path Queries on Graphs with Data  ∗ Leonid Libkin

Regular Path Queries on Graphs with Data ∗ Leonid Libkin

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2011-07-28 06:32:11
66Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri  Universit´e Laval

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

Add to Reading List

Source URL: schemeworkshop.org

Language: English - Date: 2011-08-12 16:48:41
67ε-Samples for Kernels Jeff M. Phillips University of Utah   April 3, 2012

ε-Samples for Kernels Jeff M. Phillips University of Utah April 3, 2012

Add to Reading List

Source URL: www.cs.utah.edu

Language: English - Date: 2012-04-03 18:48:02
68Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version) Juli´an Samborski-Forlese IMDEA Software Institute, Madrid, Spain Email:

Alternating Automata Semantic Constructions for the Bounded Model Checking of Regular Linear Temporal Logic (Extended Version) Juli´an Samborski-Forlese IMDEA Software Institute, Madrid, Spain Email:

Add to Reading List

Source URL: software.imdea.org

Language: English - Date: 2014-06-27 10:56:07
69On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer by P. Frankl Bell Laboratories Murray Hill, New Jersey 07974

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer by P. Frankl Bell Laboratories Murray Hill, New Jersey 07974

Add to Reading List

Source URL: www.dtc.umn.edu

Language: English - Date: 1998-04-13 22:13:21
70Regular Linear-time Temporal Logic Martin Leucker Institut f¨ur Informatik TU M¨unchenGarching, Germany Email:

Regular Linear-time Temporal Logic Martin Leucker Institut f¨ur Informatik TU M¨unchenGarching, Germany Email:

Add to Reading List

Source URL: software.imdea.org

Language: English - Date: 2014-06-27 10:56:07